On Two-Tape Real-Time Computation and Queues
نویسنده
چکیده
This is a draft version of [J. Computer and System Sciences, 29 (1984) 303 311]. A Turing machine with two storage tapes can not simulate a queue in both real-time and with at least one storage tape head always within o (n) squares from the start square. This fact may be useful for showing that a two-head tape unit is more powerful in real-time than two one-head tape units, as is commonly conjectured.
منابع مشابه
A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملAutomatic Functions, Linear Time and Learning
The present work determines the exact nature of linear time computable notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear time notions permit full learnability for learning in the limit of automatic classes (families of languages which are uniformly recognised by a finite automaton). In particu...
متن کاملThe Power of the Queue
Queues, stacks, and tapes are basic concepts which have direct applications in compiler design and the general design of algorithms. Whereas stacks (pushdown store or last-in-rst-out storage) have been thoroughly investigated and are well understood, this is much less the case for queues ((rst-in-rst-out storage). In this paper we present a comprehensive study comparing queues to stacks and tap...
متن کاملReal-Time Persistent Queues and Deques with Logic Variables (Declarative Pearl)
We present a Prolog implementation of real-time persistent queues and double-ended queues. Our implementation is inspired by Okasaki’s lazy-functional approach, but relies only on standard Prolog, comprising of the pure subset plus if-then-else constructs to efficiently implement guards and meta-calls for convenience. The resulting data structure is a nice demonstration of the fact that the use...
متن کاملEquivalence of Models of Computation for Nearly Linear Time
Theorem 1 (Main Theorem). Every non-deterministic RAM computation in time t can be simulated by a non-deterministic oblivious two-tape TM in time t polylog(t). We prove this theorem in two steps. First, we show how to simulate non-deterministic RAM machines using non-deterministic multi-tape TMs with polylogarithmic overhead. Then, we show how to simulate multi-tape TMs using oblivious two-tape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 29 شماره
صفحات -
تاریخ انتشار 1984